Verification Techniques for Distributed Algorithms
نویسندگان
چکیده
A value-passing, asynchronous process calculus and its associated theory of confluence are considered as a basis for establishing the correctness of distributed algorithms. In particular, we present an asynchronous version of value-passing CCS and we develop its theory of confluence. We show techniques for demonstrating confluence of complex processes in a compositional manner and we study properties of confluent systems that can prove useful for their verification. These results give rise to a methodology for system verification which we illustrate by proving the correctness of two distributed leader-election algorithms.
منابع مشابه
Towards Automatic Convergence Verification of Self-stabilizing Algorithms
The verification of the self-stabilization property of a distributed algorithm is a complicated task. By exploiting certain analogies between self-stabilizing distributed algorithms and globally asymptotically stable feedback systems, techniques originally developed for the verification of feedback system stability can be adopted for the verification of selfstabilization of distributed algorith...
متن کاملWhat You Always Wanted to Know About Model Checking of Fault-Tolerant Distributed Algorithms
Distributed algorithms have numerous mission-critical applications in embedded avionic and automotive systems, cloud computing, computer networks, hardware design, and the internet of things. Although distributed algorithms exhibit complex interactions with their computing environment and are difficult to understand for human engineers, computer science has developed only very limited tool supp...
متن کاملDistributed Verification: Exploring the Power of Raw Computing Power
With the increase in complexity of computer systems, it becomes more important to develop formal methods for ensuring their quality and reliability. Various techniques for automated and semi-automated analysis and verification have been successfully applied to real-life computer systems. However, these techniques are computationally hard and memory intensive in general and their applicability t...
متن کاملPoint Dose Measurement for Verification of Treatment Planning System using an Indigenous Heterogeneous Pelvis Phantom for Clarkson, Convolution, Superposition, and Fast Superposition Algorithms
Background: Nowadays, advanced radiotherapy equipment includes algorithms to calculate dose. The verification of the calculated doses is important to achieve accurate results. Mostly homogeneous dosimetric phantoms are available commercially which do not mimic the actual patient anatomy; therefore, an indigenous heterogeneous pelvic phantom mimicking actual human pelvic region has been used to ...
متن کاملA Reduction Theorem for the Verification of Round-Based Distributed Algorithms
We consider the verification of algorithms expressed in the Heard-Of Model, a round-based computational model for fault-tolerant distributed computing. Rounds in this model are communication-closed, and we show that every execution recording individual events corresponds to a coarser-grained execution based on global rounds such that the local views of all processes are identical in the two exe...
متن کامل